منابع مشابه
Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
We show that the generalized variant of formal systems where the underlying equational specifications are membership equational theories, and where the rules are conditional and can have equations, memberships and rewrites in the conditions is reflective. We also show that membership equational logic, many-sorted equational logic, and Horn logic with equality are likewise reflective. These resu...
متن کاملEquational Propositional Logic
We formalize equational propositional logic, prove that it is sound and complete, and compare the equational-proof style with the more traditional Hilbert style.
متن کاملLocal Equational Logic II
A logic may be called local if each model may be used to deene the truth. In the proposition calculus each boolean algebra deene the truth by its greatest element. In the equational logic the equality between the algebra elements deene the truth. In the clause Horn logic the truth is given by the interpretation of the predicats in the model. We give a categorial framework for these logics and w...
متن کاملFuzzy Equational Logic
Presented is a completeness theorem for fuzzy equational logic with truth values in a complete residuated lattice: Given a fuzzy set Σ of identities and an identity p ≈ q, the degree to which p ≈ q syntactically follows (is provable) from Σ equals the degree to which p ≈ q semantically follows from Σ. Pavelka style generalization of well-known Birkhoff’s theorem is therefore established.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90118-2